Data Aggregation Tree Construction: Algorithms and Challenges
نویسندگان
چکیده
منابع مشابه
A Synopsis of Energy Optimized Hybrid Data Aggregation Algorithm for WSN
Wireless sensor networks (WSNs) consist of numerous low-power sensor nodes with limited computing ability and storage capacity. Maximizing energy savings is a crucial research area in WSN. Data aggregation is the most appropriate way to resolve energy issues involves various scheduling algorithms. This paper proposes a combined framework for data aggregation that resolves many data aggregation ...
متن کاملدرخت تجمیع داده براساس الگوریتم پویای شکل گیری رودخانه درشبکه حسگر بی سیم
One of the main challenges in Wireless Sensor Networks is the limited energy of nodes which can cause to reduce the lifetime of nodes and whole network respectively. Transmissions between the nodes consumes most of the nodes' energy so minimization of unnecessary transmissions can led to reduction of energy consumption. Therefor routing protocols designed based on optimal energy consumption are...
متن کاملSpanning tree based algorithms for low latency and energy efficient data aggregation enhanced convergecast (DAC) in wireless sensor networks
Many wireless sensor networks (WSNs) employ battery-powered sensor nodes. Communication in such networks is very taxing on its scarce energy resources. Convergecast – process of routing data from many sources to a sink – is commonly performed operation in WSNs. Data aggregation is a frequently used energy-conversing technique in WSNs. The rationale is to reduce volume of communicated data by us...
متن کاملParallel Data Cube Construction: Algorithms, Theoretical Analysis, and Experimental Evaluation
Data cube construction is a commonly used operation in data warehouses. Because of the volume of data that is stored and analyzed in a data warehouse and the amount of computation involved in data cube construction, it is natural to consider parallel machines for this operation. This paper presents two new algorithms for parallel data cube construction, along with their theoretical analysis and...
متن کاملA Benchmarking Algorithm to Determine Minimum Aggregation Delay for Data Gathering Trees and an Analysis of the Diameter-Aggregation Delay Tradeoff
Aggregation delay is the minimum number of time slots required to aggregate data along the edges of a data gathering tree (DG tree) spanning all the nodes in a wireless sensor network (WSN). We propose a benchmarking algorithm to determine the minimum possible aggregation delay for DG trees in a WSN. We assume the availability of a sufficient number of unique CDMA (Code Division Multiple Access...
متن کامل